Lower Bounds for Multi-echelon Stochastic Inventory Systems

نویسندگان

  • Fangruo Chen
  • Yu-Sheng Zheng
چکیده

e establish lower bounds on the minimum costs of managing certain productiondistribution networks with setup costs at all stages and stochastic demands. These networks include serial, assembly, and one-warehouse multi-retailer systems. We obtain the bounds through novel cost-allocation schemes. We evaluate the bounds' performance for one-warehouse multi-retailer systems by comparing them with simple, heuristic policies. The bounds are quite tight for systems with a small number of retailers. We also present simplified proofs of known optimality results for serial and assembly systems. (Stationary Analysis; Cost Allocation; Economies of Scale; Multi-stage Production Systems; Distribution Networks; Replenishment Strategies)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating Echelon Stock (R, nQ) Policies in Serial Production/Inventory Systems with Stochastic Demand

T his paper studies echelon stock (R, nQ) policies in serial production/inventory systems with stochastic demand. We provide a recursive procedure to compute the steady state echelon inventory levels of the systems, which can be used to evaluate the long-run average holding and backorder costs as well as other performance measures. The procedure is based upon an observation of a relationship be...

متن کامل

Coordination Policies for Multi-Echelon Multi- Product Inventory Systems

Starting in the 1960s, a number of academic works have focused in serial and distributed multi-echelon structures and in both deterministic and stochastic environments. Clark and Scarf (1960, 1962) developed a seminal work in which they presented optimal policies for a serial multi-echelon system. Schwartz (1973) studied a deterministic model having one warehouse and N retailers and showed that...

متن کامل

Newsvendor Bounds and A Heuristic for Optimal Policies in Serial Supply Chains

We consider the classic N -stage serial supply systems with linear costs and stationary random demands. There are deterministic transportation leadtimes between stages, and unsatisfied demands are backlogged. The optimal inventory policy for this system is known to be an echelon base-stock policy, which can be computed through minimizing N nested convex functions recursively. To identify the ke...

متن کامل

Optimizing Inventory in a Multi-echelon Multi-item Supply Chain with Time-based Customer Service Level Agreements

We present a continuous-review inventory model for tactical planning in a multi-item, multi-echelon service parts distribution system with time-based service level requirements. Our goal is to determine base stock levels for all items at all locations so that the service level agreements are met at minimum investment. We present exact time-based fill rate expressions for each item and efficient...

متن کامل

Optimal and Heuristic Echelon (r, nQ, T) Policies in Serial Inventory Systems with Fixed Costs

This paper studies a periodic-review, serial inventory system in which echelon r nQ T policies are implemented. Under such a policy, each stage reviews its inventory in every T period and orders according to an echelon r nQ policy. Two types of fixed costs are considered: one is associated with each order batch Q, and the other is incurred for each inventory review. The objective is to find the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008